Computer Science Logic: 14th InternationalWorkshop, CSL 2000 Annual Conference of the EACSL Fischbachau, Germany, August 21 – 26, 2000 Proceedings
Author: Peter G. Clote, Helmut Schwichtenberg
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-67895-3
DOI: 10.1007/3-540-44622-2
Table of Contents:
- Background, Reserve, and Gandy Machines
- Choiceless Polynomial Time Computation and the Zero-One Law
- Composition and Submachine Concepts for Sequential ASMs
- Une tentative malheureuse de construire une structure éliminant rapidement les quanteurs
- Translating Theory into Practice — Abstract State Machines within Microsoft
- Choiceless Polynomial Time Logic: Inability to Express
- Schema Revisited
- Automated Verification = Graphs, Automata, and Logic
- A Fully Complete PER Model for ML Polymorphic Types
- Subtyping with Power Types
- The Descriptive Complexity of the Fixed-Points of Bounded Formulas
- Hypersequents and the Proof Theory of Intuitionistic Fuzzy Logic
- Continuous Functionals of Dependent Types and Equilogical Spaces
- Definability over Linear Constraints
- Bounded Arithmetic and Descriptive Complexity
- Independence: Logics and Concurrency
- Flatness Is Not a Weakness
- Sequents, Frames, and Completeness
- Disjunctive Tautologies as Synchronisation Schemes
- Axiomatizing the Least Fixed Point Operation and Binary Supremum
Live Music Archive
Librivox Free Audio
Metropolitan Museum
Cleveland Museum of Art
Internet Arcade
Console Living Room
Books to Borrow
Open Library
TV News
Understanding 9/11
